A refined search tree technique for Dominating Set on planar graphs
نویسندگان
چکیده
منابع مشابه
Refined Search Tree Technique for DOMINATING SET on Planar Graphs
We establish a refined search tree technique for the parameterized Dominating Set problem on planar graphs. Here, we are given an undirected graph and we ask for a set of at most k vertices such that each other graph vertex has at least one neighbor in this set. We derive search-tree based fixed-parameter solving algorithms with running times O(8n) and O(8k + n), where n is the number of vertic...
متن کاملA refined search tree technique for Dominating Set on planar graphs
We establish a refined search tree technique for the parameterized Dominating Set problem on planar graphs. Here, we are given an undirected graph and we ask for a set of at most k vertices such that every other vertex has at least one neighbor in this set. We describe algorithms with running times O(8n) and O(8k+n), where n is the number of vertices in the graph, based on bounded search trees....
متن کاملCapacitated Dominating Set on Planar Graphs
Capacitated Domination generalizes the classic Dominating Set problem by specifying for each vertex a required demand and an available capacity for covering demand in its closed neighborhood. The objective is to find a minimum-sized set of vertices that can cover all of the graph’s demand without exceeding any of the capacities. In this paper we look specifically at domination with hard-capacit...
متن کاملDistributed Dominating Set Approximations beyond Planar Graphs
The Minimum Dominating Set (MDS) problem is one of the most fundamental and challenging problems in distributed computing. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last years, there has been much progress on computing local approximations on sparse graphs, and in particular planar graphs. In this paper we study distributed an...
متن کاملLocal Approximability of Minimum Dominating Set on Planar Graphs
We show that there is no deterministic local algorithm (constant-time distributed graph algorithm) that finds a (7 − )-approximation of a minimum dominating set on planar graphs, for any positive constant . In prior work, the best lower bound on the approximation ratio has been 5− ; there is also an upper bound of 52.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2005
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2004.03.007